Towards a Logic of Dilation
نویسندگان
چکیده
We investigate the notion of dilation of a propositional theory based on neighbourhoods in a generalized approximation space. We take both a semantic and a syntactic approach in order to define a suitable notion of theory dilation in the context of approximate reasoning on the one hand, and a generalized notion of forgetting in propositional logic on the other hand. We place our work in the context of existing theories of approximation spaces and forgetting, and show that neighbourhoods obtained by combining collective and selective dilation provide a suitable semantic framework within which to reason computationally with uncertainty in a classical setting.
منابع مشابه
Coverage Improvement In Wireless Sensor Networks Based On Fuzzy-Logic And Genetic Algorithm
Wireless sensor networks have been widely considered as one of the most important 21th century technologies and are used in so many applications such as environmental monitoring, security and surveillance. Wireless sensor networks are used when it is not possible or convenient to supply signaling or power supply wires to a wireless sensor node. The wireless sensor node must be battery powered.C...
متن کاملOptimization of Quantum Cellular Automata Circuits by Genetic Algorithm
Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...
متن کاملMerging First-Order Knowledge Using Dilation Operators
The area of knowledge merging is concerned with merging conflicting information while preserving as much as possible. Most proposals in the literature work with knowledge bases expressed in propositional logic. We propose a new framework for merging knowledge bases expressed in (subsets of) first-order logic. Dilation operators (a concept originally introduced by Bloch and Lang) are employed an...
متن کاملDomain Theory Meets Default Logic 1
We present a development of the theory of default information structures, combining ideas from domain theory with ideas from non-monotonic logic. Conceptually, our treatment is distinguished from standard default logic in that we view default structures as generating models rather than theories. Reiter's default rules are viewed as non-deterministic algorithms for generating preferred partial m...
متن کاملFirst-Order Belief Merging using Dilations
The aim of belief merging is to merge conflicting information while preserving as much of it as possible. Most proposals in the literature work with knowledge bases expressed in propositional logic. We propose a new framework for merging knowledge bases expressed in (subsets of) first-order logic. Dilation operators (a concept originally introduced by Bloch and Lang) are employed and developed,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014